Steiner tree problem - PDFSEARCH.IO - Document Search Engine

Steiner tree problem
Results: 87

#	Item
41	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
42	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:04:38 Polytopes Euclidean plane geometry Polyhedra Rectilinear polygon Vertex Polyhedron Simple polygon Steiner tree problem Dual polyhedron Geometry Graph theory Polygons
43	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
44	16th Canadian Conference on Computational Geometry, 2004 Approximating optimal paths in terrains with weight defined by a piecewise-linear function J. A. P´erez Ruy-D´ıaz Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Curves NP-complete problems Network theory Routing algorithms Steiner tree problem Shortest path problem A* search algorithm Catenary Graph Graph theory Mathematics Theoretical computer science
45	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Vertex cover Tree Steiner tree problem Widest path problem Graph theory Theoretical computer science Mathematics
46	cccg-cluster_visibility-2.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 NP-complete problems Art gallery problem Steiner tree problem Vertex Connectivity Pseudotriangle Tree Graph Dominating set Graph theory Mathematics Theoretical computer science
47	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
48	CCCG 2009, Vancouver, BC, August 17–19, 2009 An Inequality on the Edge Lengths of Triangular Meshes∗ Minghui Jiang† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 21:17:54 Topology Triangles Triangle geometry Geometric topology Simplex Triangle Polygon Delaunay triangulation Steiner tree problem Geometry Mathematics Triangulation
49	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
50	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ Joondong Kim∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:57 NP-complete problems Steiner tree problem Minimum spanning tree Eulerian path Matching Graph coloring Tree Connectivity Matroid theory Graph theory Mathematics Theoretical computer science